On Coloring the Odd-Distance Graph
نویسنده
چکیده
We present a proof, using spectral techniques, that there is no finite measurable coloring of the odd-distance graph.
منابع مشابه
The Odd-Distance Plane Graph
The vertices of the odd-distance graph are the points of the plane R. Two points are connected by an edge if their Euclidean distance is an odd integer. We prove that the chromatic number of this graph is at least five. We also prove that the odd-distance graph in R is countably choosable, while such a graph in R is not.
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملDistance Coloring of the Hexagonal Lattice
Motivated by the frequency assignment problem we study the ddistant coloring of the vertices of an infinite plane hexagonal lattice H. Let d be a positive integer. A d-distant coloring of the lattice H is a coloring of the vertices of H such that each pair of vertices distance at most d apart have different colors. The d-distant chromatic number of H, denoted χd(H), is the minimum number of col...
متن کاملSome Coloring Problems in Ramsey Theory
In this thesis, we present new results which are concerned with the following four coloring problems in Ramsey Theory. i. The finite form of Brown’s Lemma. ii. Some 2-color Rado numbers. iii. Ramsey results involving Fibonacci sequences. iv. Coloring the odd-distance plane graph. A few of the results in this thesis are cited from earlier works of other authors. Several results are cited from pa...
متن کاملA Note on Chromatic Number and Induced Odd Cycles
An odd hole is an induced odd cycle of length at least 5. Scott and Seymour confirmed a conjecture of Gyárfás and proved that if a graph G has no odd holes then χ(G) 6 22 ω(G)+2 . Chudnovsky, Robertson, Seymour and Thomas showed that if G has neither K4 nor odd holes then χ(G) 6 4. In this note, we show that if a graph G has neither triangles nor quadrilaterals, and has no odd holes of length a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 16 شماره
صفحات -
تاریخ انتشار 2009